Continuous flows with Markov families
نویسندگان
چکیده
منابع مشابه
Continuous Markov equilibria with quasi-geometric discounting
We prove that the standard quasi-geometric discounting model used in dynamic consumer theory and political economics does not possess continuous Markov perfect equilibria (MPE) if there is a strictly positive lower bound on wealth. We also show that, at points of discontinuity, the decision maker strictly prefers lotteries over the next period’s assets. We then extend the standard model to have...
متن کاملMarkov Decision Processes with Continuous Side Information
We consider a reinforcement learning (RL) setting in which the agent interacts with a sequence of episodic MDPs. At the start of each episode the agent has access to some side-information or context that determines the dynamics of the MDP for that episode. Our setting is motivated by applications in healthcare where baseline measurements of a patient at the start of a treatment episode form the...
متن کاملMarkov Random Walk Representations with Continuous Distributions
Representations based on random walks can exploit discrete data distributions for cluster ing and classification. We extend such rep resentations from discrete to continuous dis tributions. Transition probabilities are now calculated using a diffusion equation with a diffusion coefficient that inversely depends on the data density. We relate this diffu sion equation to a path integral and d...
متن کاملOn Markov Chains with Continuous State Space
In this expository paper, we p r o ve the following theorem, which m a y be of some use in studying Markov chain Monte Carlo methods like hit and run, the Metropolis algorithm, or the Gibbs sampler. Suppose a discrete-time Markov c hain is aperiodic, irreducible, and there is a stationary probability distribution. Then from almost all starting points the distribution of the chain at time n conv...
متن کاملCombinatorial Continuous Maximal Flows
Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching and texture synthesis. Algorithms based on the classical formulation of maxflow defined on a graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japanese journal of mathematics. New series
سال: 1990
ISSN: 0289-2316,1861-3624
DOI: 10.4099/math1924.16.1